Effect of DisCSP variable-ordering heuristics in scale-free networks

Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks

A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various algorithms for solving DisCSPs have been developed, which are intended for general purposes, i.e., they can be applied to any network structure. However, if a network has some particular structure, e.g., the network structu...

Variable Ordering Heuristics Show Promise

Evolving Variable-Ordering Heuristics for Constrained Optimisation

In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach offers two significant advantages over existing methods: it allows the evolution of more complex combinations of heuristics, and; it can identify fruitful synergies among heuristics. Using four different classes of MAX-S...

On Conflict-driven variable ordering heuristics

It is well known that the order in which variables are instantiated by a backtracking search algorithm can make an enormous difference to the search effort in solving CSPs. Among the plethora of heuristics that have been proposed in the literature to efficiently order variables during search, a significant recently proposed class uses the learning-from-failure approach. Prime examples of such h...

Efficient Variable Ordering Heuristics for Shared ROBDD

Pi-Yu Chung, Ibrahim N. Hajj, and Janak H. Patel Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Abstract In this paper we describe several ordering heuristics for shared, Reduced and Ordered Binary Decision Diagrams(ROBDDs). These heuristics have been tested on ISCAS and MCNC benchmark circuits. In all examples, th...